---
categories: Graph algorithms, Graph theory, Combinatorial optimization
---

## Problems
- [Maximum Flow](https://open.kattis.com/problems/maxflow)
- [March of the Penguins](https://open.kattis.com/problems/marchofpenguins)
- [Councilling](https://open.kattis.com/problems/councilling)
- [Budget](https://open.kattis.com/problems/budget)

## External links
- [Algorithm Design](http://www.cs.princeton.edu/~wayne/kleinberg-tardos/) slides:
    - [Network Flow I](http://www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/07NetworkFlowI.pdf)
    - [Network Flow II](http://www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/07NetworkFlowII.pdf)
    - [Network Flow III](http://www.cs.princeton.edu/~wayne/kleinberg-tardos/pdf/07NetworkFlowIII.pdf)
- [TopCoder tutorial](https://www.topcoder.com/community/data-science/data-science-tutorials/) on maximum flow:
    - [Section 1](https://www.topcoder.com/community/data-science/data-science-tutorials/maximum-flow-section-1/)
    - [Section 2](https://www.topcoder.com/community/data-science/data-science-tutorials/maximum-flow-section-2/)


## See also
- [Minimum cut]()
- [Minimum cost maximum flow]()